全文获取类型
收费全文 | 2923篇 |
免费 | 265篇 |
国内免费 | 271篇 |
专业分类
电工技术 | 112篇 |
综合类 | 274篇 |
化学工业 | 90篇 |
金属工艺 | 10篇 |
机械仪表 | 57篇 |
建筑科学 | 49篇 |
矿业工程 | 13篇 |
能源动力 | 14篇 |
轻工业 | 23篇 |
水利工程 | 16篇 |
石油天然气 | 17篇 |
武器工业 | 5篇 |
无线电 | 1138篇 |
一般工业技术 | 58篇 |
冶金工业 | 28篇 |
原子能技术 | 7篇 |
自动化技术 | 1548篇 |
出版年
2024年 | 5篇 |
2023年 | 16篇 |
2022年 | 22篇 |
2021年 | 21篇 |
2020年 | 34篇 |
2019年 | 28篇 |
2018年 | 33篇 |
2017年 | 51篇 |
2016年 | 68篇 |
2015年 | 84篇 |
2014年 | 158篇 |
2013年 | 167篇 |
2012年 | 232篇 |
2011年 | 235篇 |
2010年 | 211篇 |
2009年 | 233篇 |
2008年 | 261篇 |
2007年 | 308篇 |
2006年 | 224篇 |
2005年 | 218篇 |
2004年 | 154篇 |
2003年 | 153篇 |
2002年 | 113篇 |
2001年 | 86篇 |
2000年 | 62篇 |
1999年 | 40篇 |
1998年 | 21篇 |
1997年 | 19篇 |
1996年 | 18篇 |
1995年 | 11篇 |
1994年 | 2篇 |
1993年 | 11篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1985年 | 12篇 |
1984年 | 28篇 |
1983年 | 23篇 |
1982年 | 22篇 |
1981年 | 21篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 3篇 |
排序方式: 共有3459条查询结果,搜索用时 15 毫秒
11.
12.
Hyuntae ParkAuthor VitaeHyejeong HongAuthor Vitae Sungho KangAuthor Vitae 《Computer Networks》2012,56(1):231-243
Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search. 相似文献
13.
文章提出了在不同操作系统以及不同平台上获取MAC地址的方法。以目前比较典型的两种操作系统:UNIX操作系统和WINDOWS操作系统为例,阐述了具体方法,并给出了相应的C/C++语言读取MAC地址的实现程序。 相似文献
14.
15.
16.
17.
Using the concentric spheres free surface model and a standard 4th polynomial Karman—Pohlansen method, the dimensionless tangential stress distribution, and the dimensionless pressure distribution around a solid sphere in a swarm, and the viscous, form and total drag coefficient for multi-solid particle systems were computed numerically at higher Reynolds numbers. The void function obtained from the drag coefficient for multiparticle system was comparative to the experimental data. The friction factor for multi-particle systems so computed agreed with the experimental data of packed and distended beds. 相似文献
18.
针对计算机网络课程的理论性、实践性和抽象性等特点,提出计算机网络课程案例教学法的可行性方案及其应用。通过TCP/IP协议族分层的原因和IP地址存在的原因和作用这两个具体的教学案例,开展具体的案例教学活动。分析表明,案例教学法在计算机网络课程教学中非常有效,应该进行推广和实施。 相似文献
19.
内网信息系统主要为企业内部提供信息的传递合和分享,意义十分重大,在网络技术促进信息交流的同时,也出现了一些安全隐患对系统的安全构成威胁,极易造成内部信息失真或被篡改窃取,因此,必须采取相应的防护措施保证系统安全运行。 相似文献
20.